Term satisfiability in FLew-algebras
نویسندگان
چکیده
FLew-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FLew-terms and FLew-algebras. For each FLew-algebra, the sets of its satisfiable and positively satisfiable terms can be viewed as fragments of its existential theory; we identify and investigate the complements as fragments of its universal theory. We offer characterizations of those algebras that (positively) satisfy just those terms that are satisfiable in the two-element Boolean algebra providing its semantics to classical propositional logic. In case of positive satisfiability, these algebras are just the nontrivial weakly contractive algebras. In case of satisfiability, we give a characterization by means of another property of the algebra, the existence of a two-element congruence. Further, we argue that (positive) satisfiability problems in FLew-algebras are computationally hard. Some previous results in the area of term satisfiabilty in MV-algebras or BL-algebras, are thus brought to a common footing with, e.g., known facts on satisfiability in Heyting algebras.
منابع مشابه
The variety of modal FLew-algebras is generated by its finite simple members
In this paper, we prove that the variety of modal FLew-algebras is generated by its finite simple members. The result is obtained by showing that every free modal FLew-algebra is semisimple and then showing that every variety generated by a simple modal FLew-algebra is generated by a set of finite simple modal FLew-algebras.
متن کاملSemisimplicity, EDPC and Discriminator Varieties of Residuated Lattices
We prove that all semisimple varieties of FLew-algebras are discriminator varieties. A characterisation of discriminator and EDPC varieties of FLew-algebras follows. It matches exactly a natural classification of logics over FLew proposed by H. Ono.
متن کاملTerm Satisfiability Problem for Two-Element Algebras is in QL or is NQL-Complete
We show that the term satisfiability problem for finite algebras is in NQL. Moreover we present a complete classification of the computational complexity of the term satisfiability problem for two-element algebras. We show that for any fixed twoelement algebra the problem is either in QL or NQL-complete. We show that the complexity of the considered problem, parameterized by an algebra, is dete...
متن کاملSemisimplicity, Amalgamation Property and Finite Embeddability Property of Residuated Lattices
In this thesis, we study semisimplicity, amalgamation property and finite embeddability property of residuated lattices. We prove semisimplicity and amalgamation property of residuated lattices which are of purely algebraic character, by using proof-theoretic methods and results of substructural logics. On the other hand, we show the finite model property (FMP) for various substructural logics,...
متن کاملSolving Satisfiability of Ground Term Algebras Using DPLL and Unification
Abstract datatypes can be viewed as sorted ground term algebras. Unification can be used to solve conjunctions of equations. We give a new algorithm to extend this to the full quantifier free fragment, i.e. including formulas with disjunction and negation. The algorithm is based on unification (to deal with equality) and DPLL (to deal with propositional logic). In this paper we present our algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 631 شماره
صفحات -
تاریخ انتشار 2016